A refinement operator for inducing Description Logics
نویسندگان
چکیده
We present a new refinement operator that guides an ILP search through a lattice of a Horn clause representation of Description Logic (DL) clauses. Our operator dramatically narrows the search space by being aware of syntactic restrictions on the Horn representation stemming from both the syntax and semantics of DLs as well as from axioms present in the specific background of each experiment.
منابع مشابه
Concept Learning in Description Logics
The problem of learning logic programs has been researched extensively, but other knowledge representations formalisms like Description Logics are also an interesting target language. The importance of inductive reasoning in Description Logics has increased with the rise of the Semantic Web, because the learning algorithms can be used as a means for the computer aided building of ontologies. On...
متن کاملIdeal Downward Refinement in the EL Description Logic
With the proliferation of the Semantic Web, there has been a rapidly rising interest in description logics, which form the logical foundation of the W3C standard ontology language OWL. While the number of OWL knowledge bases grows, there is an increasing demand for tools assisting knowledge engineers in building up and maintaining their structure. For this purpose, concept learning algorithms b...
متن کاملIdeal Downward Refinement in the EL Description Logic
With the proliferation of the Semantic Web, there has been a rapidly rising interest in description logics, which form the logical foundation of the W3C standard ontology language OWL. While the number of OWL knowledge bases grows, there is an increasing demand for tools assisting knowledge engineers in building up and maintaining their structure. For this purpose, concept learning algorithms b...
متن کاملA Refinement Operator Based Learning Algorithm for the ALC Description Logic
With the advent of the Semantic Web, description logics have become one of the most prominent paradigms for knowledge representation and reasoning. Progress in research and applications, however, faces a bottleneck due to the lack of available knowledge bases, and it is paramount that suitable automated methods for their acquisition will be developed. In this paper, we provide the first learnin...
متن کاملKnowledge Base Revision in Description Logics
Ontology evolution is an important problem in the Semantic Web research. Recently, Alchourrón, Gärdenfors and Markinson’s (AGM) theory on belief change has been applied to deal with this problem. However, most of current work only focuses on the feasibility of the application of AGM postulates on contraction to description logics (DLs), a family of ontology languages. So the explicit constructi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012